Local Search Heuristics for NFA State Minimization Problem
نویسنده
چکیده
In the present paper we introduce new heuristic methods for the state minimization of nondeterministic finite automata. These methods are based on the classical Kameda-Weiner algorithm joined with local search heuristics, such as stochastic hill climbing and simulated annealing. The description of the proposed methods is given and the results of the numerical experiments are provided.
منابع مشابه
A New NFA Reduction Algorithm for State Minimization Problem
The problem of creating a minimal NFA is a primal (fundamental) problem. Reducing the size of NFA by using NFA Reduction Algorithm has been shown to reduce importantly the search time. This paper innovate a new NFA reduction algorithm for the state minimization of NFA. The analysis of the proposed algorithm is given and also demonstrates the results of the numerical experiments. This paper conc...
متن کاملLR Rotation Rule for Creating Minimal NFA
The problem of creating a minimal NFA is a primal (fundamental) problem. Reducing the size of NFA by using LR rotation rule has been shown to reduce importantly the search time. In [1] Ilie and Yu describe a construction of a right invariant equivalence relation on the states of a nondeterministic finite state automaton. We give a more efficient LR Rotation rule for constructing the minimal NFA...
متن کاملIterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کاملA NEW APPROACH TO THE SOLUTION OF SENSITIVITY MINIMIZATION IN LINEAR STATE FEEDBACK CONTROL
In this paper, it is shown that by exploiting the explicit parametric state feedback solution, it is feasible to obtain the ultimate solution to minimum sensitivity problem. A numerical algorithm for construction of a robust state feedback in eigenvalue assignment problem for a controllable linear system is presented. By using a generalized parametric vector companion form, the problem of eigen...
متن کاملComputational Complexity of NFA Minimization for Finite and Unary Languages
We investigate the computational complexity of the nondeterministic finite automaton (NFA) minimization problem for finite and unary regular languages, if the input is specified by a deterministic finite state machine. While the general case of this problem is PSPACEcomplete [13], it becomes theoretically easier when restricted to the aforementioned language families. It is easy to see that in ...
متن کامل